Inapproximability Bounds for Shortest-Path Network Interdiction Problems
نویسندگان
چکیده
We consider two network interdiction problems: one where a network user tries to traverse a network from a starting vertex s to a target vertex t along the shortest path while an interdictor tries to eliminate all short s-t paths by destroying as few vertices (arcs) as possible, and one where the network user, as before, tries to traverse the network from s to t along the shortest path while the interdictor tries to destroy a fixed number of vertices (arcs) so as to cause the biggest increase in the shortest s-t path. The latter problem is known as the Most Vital Vertices (Arcs) Problem. In this paper we provide inapproximability bounds for several variants of these problems.
منابع مشابه
Network interdiction – models, applications, unexplored directions
Network interdiction is the monitoring or halting of an adversary’s activity on a network. Its models involve two players, usually called the interdictor and the evader (or, in the more general context of Stackelberg games, leader and follower). The evader operates on the network to optimize some objective such as moving through the network as fast as possible (shortest path interdiction), or w...
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملInterdiction of a Markovian Evader
Shortest path network interdiction is a combinatorial optimization problem on an activity network arising in a number of important security-related applications. It is classically formulated as a bilevel maximin problem representing an “interdictor” and an “evader”. The evader tries to move from a source node to the target node along a path of the least cost while the interdictor attempts to fr...
متن کاملPacking Interdiction and Partial Covering Problems
In the Packing Interdiction problem we are given a packing LP together with a separate interdiction cost for each LP variable and a global interdiction budget. Our goal is to harm the LP: which variables should we forbid the LP from using (subject to forbidding variables of total interdiction cost at most the budget) in order to minimize the value of the resulting LP? Interdiction problems on g...
متن کاملInterdiction Problems on Planar Graphs
We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We give a multiplicative (1+ǫ)-approxi...
متن کامل